The Umbral Transfer-Matrix Method, III: Counting Animals
نویسنده
چکیده
This is the third part of the five-part saga on the umbral transfermatrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. In this article we describe the Maple package ZOO that for any specific k, automatically constructs an umbral scheme for enumerating “k-board” lattice animals (polyominoes) on the two-dimensional square lattice. Such umbral schemes enable counting these important classes of animals in polynomial time as opposed to the exponential time that is required for counting all animals.
منابع مشابه
THE UMBRAL TRANSFER-MATRIX METHOD V. The Goulden-Jackson Cluster Method for Infinitely Many Mistakes
This is the fifth, and last, installment of the saga on the Umbral Transfer-Matrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. Here we extend the powerful GouldenJackson Cluster method, that enables one to compute generating functions enumerating words that avoid, as factors, any given finite set of “mistakes”, to the case where there are infinitely many mistakes. This infin...
متن کاملThe Half-Perimeter Generating Function of Gated and Wicketed Ferrers Diagrams
We show that the half-perimeter generating functions for the number of wicketed and gated Ferrers diagrams is algebraic. Furthermore, the generating function of the wicketed Ferrers diagrams is closely related to the generating function of the Catalan numbers. The methodology of the experimentation, as well as the proof, is the umbral transfer matrix method.
متن کاملThe Umbral Transfer-Matrix Method. I. Foundations
According to cohen venavi, a classic Hebrew essay by Ekhad Ha-Am, there are two ways of serving God: Priest and Prophet. The priest is a very skilled technician who knows by heart the 613 mitzvahs, and who can slaughter a lamb with due regard to the many rigorous and subtle laws. On the other hand, a prophet is often very clumsy in the day-to-day ritual, and is unable to sacrifice an animal pro...
متن کاملCounting hexagonal lattice animals confined to a strip
We describe a bijection between hexagonal lattice animals and a special type of square lattice animals. Using this bijection we adopt Maple packages that automatically generates generating functions (and series expansions) for fixed square lattice lattice animals to that of fixed hexagonal animals on the two-dimensional hexagonal lattice confined to a strip 0 ≤ y ≤ k, for arbitrary k. In [Z1], ...
متن کاملA Novel Method for Counting Models on Grid Boolean Formulas
We research on the possible orientations patterns of a grid graph G, and propose a method for counting certain combinatorial structures over the class of orientations of G. For example, our method can be applied for counting sink-free orientations of G, as well as it can be applied for solving the #2SAT problem for grid Boolean formulas. Our proposal extends the classical transfer matrix method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001